Monotonic Abstraction Techniques: from Parametric to Software Model Checking
نویسندگان
چکیده
منابع مشابه
Monotonic Abstraction Techniques: from Parametric to Software Model Checking
Monotonic abstraction is a technique introduced in model checking parameterized distributed systems in order to cope with transitions containing global conditions within guards. The technique has been re-interpreted in a declarative setting in previous papers of ours and applied to the verification of fault tolerant systems under the so-called ‘stopping failures’ model. The declarative reinterp...
متن کاملReduction and Abstraction Techniques for Model Checking
Model checking is an increasingly popular method for verification of safety-critical systems. The main obstacle of this verification method is a state space explosion problem and consequently high computational requirements of model checking algorithms. In order to make the model checking method practically feasible, it is necessary to develop powerful techniques for fighting state space explos...
متن کاملAutomatic Abstraction Techniques for Propositional µ-calculus Model Checking
An abstraction/reenement paradigm for the full propositional-calculus is presented. No distinction is made between universal or ex-istential fragments. Necessary conditions for conservative veriication are provided, along with a fully automatic symbolic model checking abstraction algorithm. The algorithm begins with conservative veriication of an initial abstraction. If the conclusion is negati...
متن کاملModel Checking Software Requirement Specifications using Domain Reduction Abstraction
As an automated verification and validation tool, model checking can be quite effective in practice, especially when it is used in the context of specification-centered or component-based software development frameworks. Nevertheless, model checking has been quite inefficient when dealing with systems with data variables over a large (or infinite) domain, which is a serious limiting factor for ...
متن کاملAutomatic Abstraction in SMT-Based Unbounded Software Model Checking
Software model checkers based on under-approximations and SMT solvers are very successful at verifying safety (i.e., reachability) properties. They combine two key ideas – (a) concreteness: a counterexample in an under-approximation is a counterexample in the original program as well, and (b) generalization: a proof of safety of an underapproximation, produced by an SMT solver, are generalizabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.168.1